package top.hkyzf.study.leetcode.string;

import org.junit.Test;

/**
 * @author zhufeng
 * @version 1.0
 * @date 2022-3-6 23:40
 */
public class 最长特殊序列Ⅰ_521 {
    public int findLUSlength(String a, String b) {
        return a.equals(b) ? -1 : Math.max(a.length(), b.length());
    }

    @Test
    public void testFindLUSlength () {
        String a = "aba";
        String b = "cdc";
        System.out.println(findLUSlength(a, b));
    }
}
